Construction of cospectral graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A construction of distance cospectral graphs

The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edge counts yet are cospectral with respect to the distance matrix. Further, we identify a subgraph switching behavior which constructs additional dis...

متن کامل

A Construction of Cospectral Graphs for the Normalized Laplacian

We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix A + tD. We p...

متن کامل

Enumeration of cospectral graphs

We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...

متن کامل

Cospectral Graphs on 12 Vertices

We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related to the number of cospectral graphs.

متن کامل

Graphs cospectral with starlike trees

A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called m-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2019

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-019-00900-y